Deterministic Sample Consensus with Multiple Match Hypotheses
نویسندگان
چکیده
RANSAC (Random Sample Consensus) is a popular and effective technique for estimating model parameters in the presence of outliers. Efficient algorithms are necessary for both frame-rate vision tasks and offline tasks with difficult data. We present a deterministic scheme for selecting samples to generate hypotheses, applied to data from feature matching. This method combines matching scores, ambiguity and past performance of hypotheses generated by the matches to estimate the probability that a match is correct. At every stage the best matches are chosen to generate a hypothesis. This method will therefore only spend time on bad matches when the best ones have proven themselves to be unsuitable. The result is a system that is able to operate very efficiently on ambiguous data and is suitable for implementation on devices with limited computing resources.
منابع مشابه
On the Sample Complexity of Weakly Learning
In this paper, we study the sample complexity of weak learning. That is, we ask how much data must be collected from an unknown distribution in order to extract a small but significant advantage in prediction. We show that it is important to distinguish between those learning algorithms that output deterministic hypotheses and those that output randomized hypotheses. We prove that in the weak l...
متن کاملReflective Symmetry Detection by Rectifying Randomized Correspondences
Images often contain multiple reflective symmetries. We propose a method to detect multiple reflective symmetries at different scales and viewpoints based on the J-linkage framework [5], which combines ideas from RANSAC (robustness against outliers) and the Hough transform (multiple models detection through voting schemes). How J-linkage works in symmetry detection ? Given N reflective matches ...
متن کاملModel Combination for Machine Translation
Machine translation benefits from two types of decoding techniques: consensus decoding over multiple hypotheses under a single model and system combination over hypotheses from different models. We present model combination, a method that integrates consensus decoding and system combination into a unified, forest-based technique. Our approach makes few assumptions about the underlying component...
متن کاملRobust Stereo Visual Odometry Using Improved RANSAC-Based Methods for Mobile Robot Localization
In this paper, we present a novel approach for stereo visual odometry with robust motion estimation that is faster and more accurate than standard RANSAC (Random Sample Consensus). Our method makes improvements in RANSAC in three aspects: first, the hypotheses are preferentially generated by sampling the input feature points on the order of ages and similarities of the features; second, the eva...
متن کاملDe-RANSAC: Decentralized RANSAC for Sensor Networks
This paper studies the problem of distributed consensus in the presence of spurious sensor information. We propose a new method, De-RANSAC, which allows a multi-agent system to detect outliers—erroneous measurements or incorrect hypotheses—when the sensed information is gathered in a distributed way. The method is an extension of the RANSAC (RANdom SAmple Consensus) algorithm, which leads to a ...
متن کامل